منابع مشابه
The Future Fast Fourier Transform?
It seems likely that improvements in arithmetic speed will continue to outpace advances in communications bandwidth. Furthermore, as more and more problems are working on huge datasets, it is becoming increasingly likely that data will be distributed across many processors because one processor does not have sufficient storage capacity. For these reasons, we propose that an inexact DFT such as ...
متن کاملThe Fast Fourier Transform
In the next two lectures, we will continue to expand our toolbox for computing in frequency domain, by adding two important computational tools. The first, the Fast Fourier Transform (FFT) is a family of algorithms for efficiently computing the Discrete Fourier Transform. These algorithms are of great practical importance, as theymake it possible to perform frequency domain analysis of very lar...
متن کاملFractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...
متن کاملFinite Fourier Transform, Circulant Matrices, and the Fast Fourier Transform
Suppose we have a function s(t) that measures the sound level at time t of an analog audio signal. We assume that s(t) is piecewise-continuous and of finite duration: s(t) = 0 when t is outside some interval a ≤ t ≤ b. Make a change of variable x = (t− a)/(b− a) and set f(x) = s(t). Then 0 ≤ x ≤ 1 when a ≤ t ≤ b, and f(x) is a piecewise continuous function of x. We convert f(x) into a digital s...
متن کاملInteger fast Fourier transform
In this paper, a concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has the properties that it is an integer-to-integer mapping, is power adaptable and is reversible. The lifting scheme is used to approximate complex multiplications appearing in the FFT latti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 1998
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827597316266